Generalized Convexity in Multiobjective Programming
نویسندگان
چکیده
منابع مشابه
Second Order Duality in Multiobjective Programming With Generalized Convexity
The purpose of this paper is concerned with a class of multi objective programming problems in which the objective functions and constrained functions are twice differentiable and containing the support functions of a compact convex set. For such mathematic programming, to deal with its dual problem, first, the concept of second order ( , ) B p r invexity is introduced. Further, the Mangasa...
متن کاملDuality for Nondifferentiable Multiobjective Semi-infinite Programming with Generalized Convexity
The purpose of this paper is to consider the Mond-Weir type dual model for a class of non-smooth multiobjective semi-infinite programming problem. In this work, we use generalization of convexity namely ( , ) G F θ − convexity and Kuhn-Tucker constraint qualification, to prove new duality results for such semi-infinite programming problem. Weak, strong and converse duality theorems are derived....
متن کاملSufficiency and Duality in Multiobjective Programming with Generalized (f, Ρ)-convexity
A multiobjective nonlinear programming problem is considered. Sufficiency theorems are derived for efficient and properly efficient solutions under generalized (F, ρ)-convexity assumptions. Weak, strong and strict converse duality theorems are established for a general Mond–Weir type dual relating properly efficient solutions of the primal and dual problems.
متن کاملWeak efficiency in multiobjective variational problems under generalized convexity
In this paper, we provide new pseudoinvexity conditions on the involved functionals of amultiobjective variational problem, such that all vector Kuhn-Tucker or Fritz John points are weakly efficient solutions if and only if these conditions are fulfilled. We relate weakly efficient solutions to optimal solutions of weighting problems. We improve recent papers, and we generalize pseudoinvexity c...
متن کاملSecond Order (b,F)-Convexity in Multiobjective Nonlinear Programming
A new class of functions namely, second order (b,F)-convex functions, which is an extension of (b,F)-convex functions and second order F-convex functions, is introduced. Sufficient optimality conditions for proper efficiency and second order mixed type duality theorems for multiobjective nonlinear programming problems are established under the assumptions of second order (b,F)-convexity on the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1999
ISSN: 0022-247X
DOI: 10.1006/jmaa.1999.6284